Two-step Newton methods
نویسندگان
چکیده
We present sufficient convergence conditions for two-step Newton methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. The advantages of our approach under the same computational cost over other studies such as [9–25] for the semilocal convergence case are: weaker sufficient convergence conditions, more precise error bounds on the distances involved an at least as precise information on the location of the solution. In the local convergence case more precise error estimates are presented. Numerical examples involving Hammerstein nonlinear integral equations where the older convergence conditions are not satisfied but the new conditions are satisfied are also presented in this study for the semilocal convergence case. Moreover a larger convergence ball is obtained in the local convergence case. AMS Subject Classification. 65J15, 47H17 65H10, 65G99, 49M15.
منابع مشابه
A full Nesterov-Todd step interior-point method for circular cone optimization
In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملTwo-Step Derivative-Free Diagonally Newton’s Method for Large-Scale Nonlinear Equations
In this study, we extend the technique of Waziri et al. (2010a) via incorporating the two-step scheme in the framework of the diagonal Jacobian updating method to solve large-scale systems of nonlinear equations. In this approach we used points from two previous steps unlike one step approach in most Newton’s-like methods. The anticipation has been to improve the current Jacobian approximation ...
متن کاملA New High Order Closed Newton-Cotes Trigonometrically-fitted Formulae for the Numerical Solution of the Schrodinger Equation
In this paper, we investigate the connection between closed Newton-Cotes formulae, trigonometrically-fitted methods, symplectic integrators and efficient integration of the Schr¨odinger equation. The study of multistep symplectic integrators is very poor although in the last decades several one step symplectic integrators have been produced based on symplectic geometry (see the relevant lit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 30 شماره
صفحات -
تاریخ انتشار 2014